Generalized handcuffed designs
نویسندگان
چکیده
منابع مشابه
Blocking sets in handcuffed designs
In this paper we determine the spectrum of possible cardinalities of a blocking set in a H(v,3,A) and in a H(v,4,1). Moreover we construct, for each admissible ~9, a H(v,3,1) without blocking sets. Introduction A handcuffed design with parameters v, k, A, or for short an H(v,k,A), consists of a set of ordered k-subsets of a v-set, called handcuffed blocks. In a block (a., a z ' ... ,a!:) each e...
متن کاملEmbedding handcuffed designs in D-designs,
Let D be the triangle with attached edge (i. e. D is the graph having vertices {a0, a1, a2, a3} and edges {a0, a1}, {a0, a2}, {a1, a2}, {a0, a3}). J.C. Bermond and J. Schönheim [1], proved that a D-design of order n exists if and only if n ≡ 0 or 1 (mod 8). Let (W, C) be a nontrivial D-design of order n, n ≥ 8, and let V ⊂ W , |V | = v < n. We say that a handcuffed design (V,P) of order v and b...
متن کاملEmbedding handcuffed designs with block size
Let (W, C) be an m-cycle system of order n and let Ω ⊂ W , |Ω| = v < n. We say that a handcuffed design (Ω,P) of order v and block size s (2 ≤ s ≤ m−1) is contained in (W, C) if for every p ∈ P there is an m-cycle c = (a1, a2, . . . , am) ∈ C such that: (1) p = [ak, ak+1, . . . , ak+s−1] for some k ∈ {1, 2, . . . ,m} (i.e. the (s− 1)-path p occurs in the m-cycle c); and (2) ak−1, ak+s ∈ Ω. Note...
متن کاملGeneralized packing designs
Generalized t-designs, which form a common generalization of objects such as tdesigns, resolvable designs and orthogonal arrays, were defined by Cameron [P.J. Cameron, A generalisation of t-designs, Discrete Math. 309 (2009), 4835–4842]. In this paper, we define a related class of combinatorial designs which simultaneously generalize packing designs and packing arrays. We describe the sometimes...
متن کاملGeneralized whist tournament designs
In this study a new class of tournament designs is introduced. In particular, each game of the tournament involves several (two or more) teams competing against one another. The tournament is also required to satisfy certain balance conditions that are imposed on each pair of players. These balance conditions are related to both the total number of players on each team and the number of teams i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 1987
ISSN: 0097-3165
DOI: 10.1016/0097-3165(87)90002-1